On orientations and shortest paths
نویسندگان
چکیده
منابع مشابه
On Orientations and Shortest Paths
An orientation of an undirected graph is a choice of direction for each of its edges. An orientation is called ideal with respect to a given set of pairs of vertices if it does not increase the shortest-path distances between the members of any of the pairs. A polynomial-time algorithm is given for constructing an ideal orientation with respect to two given pairs and any positive edge-lengths, ...
متن کاملShortest Paths in an Arrangement with k Line Orientations
Suppose one has a line arrangement in which many lines are parallel, so that the number of diierent line orientations is k, and one wants to nd a shortest path from one point on a line in the arrangement to another such point. Using known techniques one can nd the shortest path in time and space O(n 2). We present an algorithm that can nd the shortest path in time and space O(n + k 2).
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملShortest paths on a polyhedron, Part I: Computing shortest paths
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algo...
متن کاملShortest Paths between Shortest Paths and Independent Sets
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90481-3